Exact rounding for geometric
نویسندگان
چکیده
Exact rounding is provided for elementary oating-point arithmetic operations (e.g. in the IEEE standard). Many authors have felt that it should be provided for other operations, in particular for geometric constructions. We show how one may round modular representation of numbers to the closest f.p. rep-resentable number, and demonstrate how it can be applied to a variety of geometric constructions. Our methods use only single precision; they produce compact, ef-cient, and highly parallelizable code. We suggest that they can be applied in other settings when exact computations interact closely with rounded representations.
منابع مشابه
Shortest Path Geometric
Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signiicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accura...
متن کاملExact rounding for geometric constructions
Exact rounding is provided for elementary floating-point arithmetic operations (e.g. in the IEEE standard). Many authors have felt that it should be provided for other operations, in particular for geometric constructions. We show how one may round modular representation of numbers to the closest f.p. representable number, and demonstrate how it can be applied to a variety of geometric construc...
متن کاملPractical methods for set operations on polygons using exact arithmetic
We present here numerical and combinatorial methods that permit the use of exact arithmetic in the construction of unions and intersection of polygonal regions. An argument is given that, even in an exact arithmetic system , rounding of coordinates is necessary. We also argue that it is natural and useful to round to a nonuniform grid, and we give methods for calculating the nearest grid point....
متن کاملInterval Arithmetic: an Efficient Implementation and an Application to Computational Geometry
We discuss interval techniques for speeding up the exact evaluation of geometric predicates and describe a C++ implementation of interval arithmetic that is strongly innuenced by the rounding modes of the widely used IEEE 754 standard. Using this approach we engineer an eecient oating point lter for the computation of geometric predicates. We validate our approach experimentally, comparing it w...
متن کاملar X iv : c s / 99 07 02 9 v 1 [ cs . C G ] 1 9 Ju l 1 99 9 Further Results on Arithmetic Filters for Geometric Predicates ∗
An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result. In this note, we studies the statistical efficiency of fi...
متن کامل